无人作战飞机通信延时仿真

通信作为无人作战飞机任务控制站与无人作战飞机之间的纽带,在无人作战飞机系统中起着至关重要的作用。简要阐述了引起无人作战飞机通信延时的具体因素,分析了无人作战飞机使用的几种通信方式,提出并运用网络仿真工具NS2(networksimulation-2)针对视线通信方式和不同中继方式下的通信延时进行了仿真,最后对仿真作了分析和解释。     

基于飞行时间的弹道导弹火力控制

为了达到最佳射击效果,弹道导弹突击目标时经常需要多枚导弹同时击中目标,因此根据飞行时间确定发射时间则成为弹道导弹火力控制问题的重要内容。以具体导弹为例,采用仿真的方法分析了影响飞行时间的内在原因,得出了明确的结论,使导弹部队能够根据飞行时间确定发射时间,从而合理地进行火力控制,提高毁伤效果和震慑力。     

多目标攻击导弹捷联惯导的传递对准

在分析中距复合制导空空导弹捷联惯导传递对准的基础上,提出由机载火控系统根据导弹发射包线计算发出开始捷联惯导传递对准精对准的时刻,导弹惯导提前进行传递精对准的方法。利用此方法可以解决机载武器系统多目标攻击空空导弹传递对准满足连续发射多枚导弹实时性要求的问题。最后,在单目标情况下就开始传递对准时刻包线给出了算例。     

可供实用的舰船风浪中摇荡时历预报的模式

舰船在风浪中摇荡时历的极短期预报 ,具有多方面的实用价值 .现有的各种预报方法中 ,以卷积法和时间序列法中的ARMA模型较为常用 ,但如何测量艏前波是上述方法实施的前提条件 ,则未能解决 .文中提出的在舰船舯部装塔克测波仪 ,将所测波形时历转换为艏前任意点波形时历的方法 ,可解决上述矛盾 .再采用ARMA建模、依AIC法则估计模型阶数的预报方式 ,即可用于实船进行摇荡时历短期预报     

基于多重分形广义维数的机械故障诊断方法

提出利用多重分形广义维数来描述信号特征 ,并以振动信号广义维数、广义维数谱图、敏感维数为特征向量的模式空间样本库为基础 ,给出了通过维数相关系数等判别条件进行识别的机械故障多重分形广义维数诊断方法。应用于圆盘类裂纹故障的诊断 ,取得了令人满意的结果。     

炮射导弹飞行可靠性试验法研究

结合炮射导弹的性能特点 ,研究分析了传统的飞行可靠性试验法的不足 ,提出了炮射导弹飞行可靠性试验的寿命型定时截尾指数分布新方法 ,该方法的应用使试验的方法更为可行 ,结果更为合理     

激光制导炸弹的火控原理及应用

根据某型激光制导炸弹 (L GB)的纵向控制系统 ,给出了侧向控制系统的数学模型 ;讨论了 L GB投放区的概念并通过仿真得到了工程化的投放区 ;进行了包括飞机、飞控系统、武器和火控系统在内的大闭环武器火控系统仿真     

装备器材库温湿度监控系统的设计与实现

军用装备器材仓库温湿度监控是目前亟待解决的问题.文中详细地阐述了种切实可行的设计方法--主从式两级数字化监控系统的设计原理与实现方法,并用Borland C++Builder语言对其组态软件进行程序设计.     

Waiting time analysis for a queueing system with time‐limited service and exponential timer

We consider a single‐queue with exhaustive or gated time‐limited services and server vacations, in which the length of each service period at the queue is controlled by a timer, i.e., the server serves customers until the timer expires or the queue becomes empty, whichever occurs first, and then takes vacations. The customer whose service is interrupted due to the timer expiration may be attended according to nonpreemptive or preemptive service disciplines. For the M/G/1 exhaustive/gated time‐limited service queueing system with an exponential timer and four typical preemptive/nonpreemptive service disciplines, we derive the Laplace—Stieltjes transforms and the moment formulas for waiting times and sojourn times through a unified approach, and provide some new results for these time‐limited service disciplines. © John Wiley & Sons, Inc. Naval Research Logistics 48: 638–651, 2001.     

Computational analysis of MMAP[K]/PH[K]/1 queues with a mixed FCFS and LCFS service discipline

This paper studies a queueing system with a Markov arrival process with marked arrivals and PH‐distribution service times for each type of customer. Customers (regardless of their types) are served on a mixed first‐come‐first‐served (FCFS) and last‐come‐first‐served (LCFS) nonpreemptive basis. That is, when the queue length is N (a positive integer) or less, customers are served on an FCFS basis; otherwise, customers are served on an LCFS basis. The focus is on the stationary distribution of queue strings, busy periods, and waiting times of individual types of customers. A computational approach is developed for computing the stationary distribution of queue strings, the mean of busy period, and the means and variances of waiting times. The relationship between these performance measures and the threshold number N is analyzed in depth numerically. It is found that the variance of the virtual (actual) waiting time of an arbitrary customer can be reduced by increasing N. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 399–421, 2000